Diffuse Reflections in Simple Polygons
نویسندگان
چکیده
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
منابع مشابه
Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons
We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈n2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal polygon from an arbitrary point inside it. Further, we derive lower bounds on the combinatorial complex...
متن کاملDiffuse reflection diameter in simple polygons
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the maximum number of diffuse reflections needed for a point light source to illuminate the interior of a simple polygon with n walls is bn/2c − 1. Light reflecting diffusely leaves a surface in all directions, rather than at an identical angle as with specular reflections.
متن کاملOn multiple connectedness of regions visible due to multiple diffuse reflections
It is known that the region V (s) of a simple polygon P , directly visible (illuminable) from an internal point s, is simply connected. Aronov et al. [2] established that the region V1(s) of a simple polygon visible from an internal point s due to at most one diffuse reflection on the boundary of the polygon P , is also simply connected. In this paper we establish that the region V2(s), visible...
متن کاملExpanding Visibility Polygons by Mirrors upto at least K units
We consider extending visibility polygon (V P ) of a given point q (V P (q)), inside a simple polygon P by converting some edges of P to mirrors. We will show that several variations of the problem of finding mirror-edges to add at least k units of area to V P (q) are NP-complete, or NP-hard. Which k is a given value. We deal with both single and multiple reflecting mirrors, and also specular o...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 44 شماره
صفحات -
تاریخ انتشار 2013